The time to read the input and initialise the problem = 313 ms
The time to create the optimal problem = 0 ms
The time to compute the optimal solution = 93 ms
The optimal solution is:
x11=0
x12=0
x13=1
x14=0
x15=0
x21=0
x22=1
x23=0
x24=0
x25=0
x31=1
x32=0
x33=0
x34=0
x35=0
x41=1
x42=0
x43=0
x44=0
x45=0
x51=0
x52=0
x53=1
x54=0
x55=0
x61=0
x62=0
x63=0
x64=0
x65=1
x71=0
x72=0
x73=0
x74=1
x75=0
x81=1
x82=0
x83=0
x84=0
x85=0
x91=0
x92=1
x93=0
x94=0
x95=0
x101=0
x102=0
x103=1
x104=0
x105=0
y1=1
y2=1
y3=1
y4=1
y5=1
z1=1
z2=0
z3=0
w11=64.000000
w12=18.000000
w13=66.000000
w14=21.000000
w15=13.000000
w21=0.000000
w22=0.000000
w23=0.000000
w24=0.000000
w25=0.000000
w31=0.000000
w32=0.000000
w33=0.000000
w34=0.000000
w35=0.000000
z=59869.000000
The time to read the optimal solution = 0 ms
Run time is 1906 ms
